Experimental verification of Lorentz’ linearization procedure for quadratic friction
نویسندگان
چکیده
منابع مشابه
Compact linearization for binary quadratic problems
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearizatio...
متن کاملCompact Linearization for Binary Quadratic Problems subject to Assignment Constraints
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions resolve inconsistencies that can occur when the original method is used. We also present a mixed-integer linear program to compute a minimally-sized lineari...
متن کاملA linearization framework for unconstrained quadratic (0-1) problems
In this paper, we are interested in linearization techniques for exact resolution of the Unconstrained Quadratic (0-1) Problem. Our purpose is to propose ”economical” linear formulations. We first extend the current techniques in a general linearization framework containing many other schemes and propose a new linear formulation. Numerical results comparing classical, Glover’s and the new linea...
متن کاملA new linearization method for quadratic assignment problems
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial optimization. Linearization for QAP is to transform the quadratic objective function into a linear one. Numerous QAP linearizations have been proposed, most of which yield mixed integer linear programs (MILP). Kauffmann and Broeckx’s linearization (KBL) is the current smallest one in terms of the number of va...
متن کاملA Tight Linearization Strategy for Zero-One Quadratic Programming Problems
In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fluid Dynamics Research
سال: 2005
ISSN: 0169-5983,1873-7005
DOI: 10.1016/j.fluiddyn.2005.01.005